One-Sided Optimal Assignment and Swap Algorithm for Two-Sided Optimization of Assignment Problem
نویسندگان
چکیده
منابع مشابه
An algorithm for integrated worker assignment, mixed-model two-sided assembly line balancing and bottleneck analysis
This paper addresses a multi-objective mixed-model two-sided assembly line balancing and worker assignment with bottleneck analysis when the task times are dependent on the worker’s skill. This problem is known as NP-hard class, thus, a hybrid cyclic-hierarchical algorithm is presented for solving it. The algorithm is based on Particle Swarm Optimization (PSO) and Theory of Constraints (TOC) an...
متن کاملSimultaneous Multi-Skilled Worker Assignment and Mixed-Model Two-Sided Assembly Line Balancing
This paper addresses a multi-objective mathematical model for the mixed-model two-sided assembly line balancing and worker assignment with different skills. In this problem, the operation time of each task is dependent on the skill of the worker. The following objective functions are considered in the mathematical model: (1) minimizing the number of mated-stations (2), minimizing the number of ...
متن کاملConsistency and Monotonicity in One-Sided Assignment Problems
One-sided assignment problems combine important features of two well-known matching models. First, as in roommate problems, any two agents can be matched and second, as in two-sided assignment problems, the payoffs of a matching can be divided between the agents. We take a similar approach to one-sided assignment problems as Sasaki (1995) for two-sided assignment problems and we analyze various...
متن کاملVoluntary Participation and Re-Assignment in Two-Sided Matching
How to re-allocate individuals to positions in organizations in which individuals already hold a position? This paper proposes a simple method based on a modification of the Gale-Shapley deferred acceptance alogorithm in which position-specific priorities are modified to put the originally assigned individual first. We show that the proposed mechanism is the one that maximizes the number of mov...
متن کاملArtificial bee colony algorithms for two-sided assembly line worker assignment and balancing problem
Worker assignment is a new type of problem in assembly line balancing problems, which typically occurs in sheltered work centers for the disabled. However, only a few contributions consider worker assignment in a two-sided assembly line. This research presents three variants of artificial bee colony algorithm to solve worker assignment and line balancing in two-sided assembly lines. The utiliza...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Korea Society of Computer and Information
سال: 2015
ISSN: 1598-849X
DOI: 10.9708/jksci.2015.20.12.075